Characterizing and Deciding MSO-Definability of Macro Tree Transductions
نویسندگان
چکیده
A macro tree transduction is MSO definable if and only if it is of linear size increase. Furthermore, it is decidable for a macro tree transduction whether or not it is MSO definable.
منابع مشابه
Characterizing and Deciding Mso-deenability of Macro Tree Transductions ?
A macro tree transduction is MSO deenable if and only if it is of linear size increase. Furthermore, it is decidable for a macro tree transduction whether or not it is MSO deenable.
متن کاملFinitary Compositions of Two-way Finite-State Transductions
The hierarchy of arbitrary compositions of two-way nondeterministic finite-state transductions collapses when restricted to finitary transductions, i.e., transductions that produce a finite set of outputs for each input. The hierarchy collapses to the class of nondeterministic MSO definable transductions, which is inside the second level of that hierarchy. It is decidable whether a composition ...
متن کاملTree Languages Generated be Context-Free Graph Grammars
A characterization is given of the class of tree languages which can be generated by context-free hyperedge replacement (HR) graph grammars, in terms of macro tree transducers (MTTs). A similar characterization is given of the MSO deenable tree transductions.
متن کاملAperiodic Two-way Transducers and FO-Transductions
Deterministic two-way transducers on finite words have been shown by Engelfriet and Hoogeboom to have the same expressive power as MSO-transductions. We introduce a notion of aperiodicity for these transducers and we show that aperiodic transducers correspond exactly to FO-transductions. This lifts to transducers the classical equivalence for languages between FO-definability, recognition by ap...
متن کاملA Comparison of Tree Transductionsde ned by Monadic Second Order
Formulas from monadic second order (mso) logic with one and two free variables can be used to deene the nodes and edges (respectively) of a graph, in terms of a given graph. Such mso deenable graph transductions play a role in the theory of graph grammars. Here we investigate the special case of trees. The main result is that the mso deenable tree transductions are exactly those tree transducti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000